Singular value automata and approximate minimization
نویسندگان
چکیده
منابع مشابه
Singular value automata and approximate minimization
The present paper uses spectral theory of linear operators to construct approximately minimal realizations of weighted languages. Our new contributions are: (i) a new algorithm for the SVD decomposition of infinite Hankel matrices based on their representation in terms of weighted automata, (ii) a new canonical form for weighted automata arising from the SVD of its corresponding Hankel matrix a...
متن کاملIterative Reweighted Singular Value Minimization
In this paper we study general lp regularized unconstrained matrix minimization problems. In particular, we first introduce a class of first-order stationary points for them. And we show that the first-order stationary points introduced in [11] for an lp regularized vector minimization problem are equivalent to those of an lp regularized matrix minimization reformulation. We also establish that...
متن کاملGuaranteed Rank Minimization via Singular Value Projection
Minimizing the rank of a matrix subject to affine constraints is a fundamental problem with many important applications in machine learning and statistics. In this paper we propose a simple and fast algorithm SVP (Singular Value Projection) for rank minimization with affine constraints (ARMP) and show that SVP recovers the minimum rank solution for affine constraints that satisfy the restricted...
متن کاملGuaranteed Rank Minimization via Singular Value Projection: Supplementary Material
We first give a proof of Lemma 2.1 which bounds the error of the (t + 1)-st iterate (ψ(X t+1)) in terms of the error incurred by the t-th iterate and the optimal solution. Proof of Lemma 2.1 Recall that ψ(X) = 1 2 ∥A(X) − b∥ 2 2. Since ψ(·) is a quadratic function, we have ψ(X t+1) − ψ(X t) = ⟨∇ψ(X t), X t+1 − X t ⟩ + 1 2 ∥A(X t+1 − X t)∥ 2 2 ≤ ⟨A T (A(X t) − b), X t+1 − X t ⟩ + 1 2 · (1 + δ 2k...
متن کاملAn Approximate Singular Value Decomposition of Large Matrices in Julia
In this project, I implement a parallel approximate singular value decomposition (SVD) in Julia. The approach taken here follows the algorithm described by Friedland et al., [1] and implement it using AbstractMatrices and DArrays in Julia to give the user additional flexibility. For additional speed, the algorithm makes direct calls to the DGEMV routine in the BLAS kernels. An error analysis us...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Structures in Computer Science
سال: 2019
ISSN: 0960-1295,1469-8072
DOI: 10.1017/s0960129519000094